Piecewise-smooth Refinable Functions

Univariate piecewise-smooth refinable functions (i.e., compactly supported solutions of the equation φ( 2 ) = ∑N k=0 ckφ(x−k)) are classified completely. Characterization of the structure of refinable splines leads to a simple convergence criterion for the subdivision schemes corresponding to such splines, and to explicit computation of the rate of convergence. This makes it possible to prove a factorization theorem about decomposition of any smooth refinable function (not necessarily stable or corresponding to a convergent subdivision scheme) into a convolution of a continuous refinable function and a refinable spline of the corresponding order. These results are applied to a problem of combinatorial number theory (the asymptotics of Euler’s partition function). The results of the paper generalize several previously known statements about refinement equations and help to solve two open problems. §